A VLSI Implementation of a Cascade Viterbi Decoder with Traceback

نویسندگان

  • Gennady Feygin
  • Paul Chow
  • P. Glenn Gulak
  • John Chappel
  • Grant Goodes
  • Oswin Hall
  • Ahmad Sayes
  • Satwant Singh
  • Michael B. Smith
  • Steven J. E. Wilton
چکیده

A novel VLSI implementation of the Viterbi algorithm based on a cascade architecture is presented. Survivor sequence memory management is implemented using a new single read pointer traceback technique. The overall design for a 16-qtate, rate 1/2 decoder requires about 26000 transistors and a core area of 8.5 mma in a 1.2 pm two-level metal CMOS technology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Vlsi Implementation of an Adaptive-effort Low-power Viterbi Decoder for Wireless Communications

Low-power error-correction is required for 3rd generation digital wireless devices. Adaptive-reduced state sequence detection (A-RSSD) modifies a Viterbi decoder to use far less computational effort than is typical. RSSD neglects the oldest p bits of the encoder's state machine, treating the code as if it were of length K' = K-p. Through successive reduction of p, decoding can proceed with more...

متن کامل

Survivor Sequence Memory Management in Viterbi Decoders

In a Viterbi Decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved. The register erchange method is the simplest conceptually but suffers from the disadvantage that every bit in the memory must be read and rewritten for each information bit decoded. The alternative is the traceback method where ...

متن کامل

A Low Power Viterbi Decoder Design with Minimum Transition Hybrid Register Exchange Processing for Wireless Applications

This work proposes the low power implementation of Viterbi Decoder. Majority of viterbi decoder designs in the past use simple Register Exchange or Traceback method to achieve very high speed and low power decoding respectively, but it suffers from both complex routing and high switching activity. Here simplification is made in survivor memory unit by storing only m-1 bits to identify previous ...

متن کامل

Architectural tradeoffs for survivor sequence memory management in Viterbi decoders

In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely register exchange method and traceback method. This paper extends previously known traceback approaches describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency ...

متن کامل

Good trellises for IC implementation of Viterbi decoders for linear block codes

m This paper investigates trellis structures of linear block codes for the integrated circuit (lC) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An uppe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993